Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
61	An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems Marco Maratea DIST, University of Genova, Viale F. Causa 15, Genova, Italy. Abstract Add to Reading List Source URL: ceur-ws.org Language: English - Date: 2010-05-19 04:29:26 Theoretical computer science Automated planning and scheduling Logic in computer science Mathematics Computational complexity theory Boolean algebra Electronic design automation Formal methods Boolean satisfiability problem Maximum satisfiability problem Planning Domain Definition Language Satz
62	Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Add to Reading List Source URL: web.stanford.edu Language: English - Date: 2014-04-18 04:16:48 Mathematics Search algorithms Information retrieval Information science Hashing Analysis of algorithms Cryptographic hash functions Computational complexity theory Universal hashing Hash function Randomized algorithm Subset sum problem
63	Minimizing maximum (weighted) flow-time on related and unrelated machines S. Anand1 Karl Bringmann2 Tobias Friedrich3 Naveen Garg1 Amit Kumar1 1 Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:45:57 Computational complexity theory Theory of computation Analysis of algorithms Operations research Scheduling Algorithm Mathematical logic Theoretical computer science Time complexity NC Job shop scheduling
64	Cryptographic Protocols Spring 2015 Slides for Chapter1 (part 2) Definition of zero-knowledge (ZK) Add to Reading List Source URL: www.crypto.ethz.ch Language: English - Date: 2015-03-06 05:37:28 Cryptography Computing Computational complexity theory Proof of knowledge IP Distribution Challengeresponse authentication Communications protocol ZK Zero-knowledge proof
65	Tight Bounds for Parallel Randomized Load Balancing [Extended Abstract] ∗ Christoph Lenzen Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:31 Analysis of algorithms Computational complexity theory Theory of computation Mathematics Balls into bins With high probability Sorting algorithm Leader election Time complexity Entropy Best worst and average case Big O notation
66	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: comopt.ifi.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
67	UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll Add to Reading List Source URL: mapcontext.com Language: English Parallel computing Computer science Computational complexity theory Computational geometry Randomized algorithm Sweep line algorithm Polyhedron Mathematics Spanning tree Hidden line removal Arrangement of lines
68	OPTIMIZING PHYLOGENETIC DIVERSITY ACROSS TWO TREES MAGNUS BORDEWICH, CHARLES SEMPLE, AND ANDREAS SPILLNER Abstract. We present a polynomial-time algorithm for finding an optimal set of taxa that maximizes the weighted-su Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2007-10-09 08:45:20 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Matching Flow network 3-dimensional matching Vertex cover
69	LNCSFixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction Add to Reading List Source URL: www.cs.tau.ac.il Language: English - Date: 2009-01-01 08:42:54 Computational complexity theory Graph theory Mathematics Phylogenetics NP-complete problems Computational phylogenetics Analysis of algorithms Probabilistic complexity theory Randomized algorithm Steiner tree problem Algorithm Maximum parsimony
70	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www.qiqiyan.com.s3-website-us-east-1.amazonaws.com Language: English - Date: 2012-07-04 18:28:36 Mathematical optimization Mathematics Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method